Numerical study of recent interior point approaches for linear programming

B. Zaoui, D. Benterki S. Khelladi

In this work, a comparative numerical study of a primal-dual interior point method based on recent descent directions is presented. We give a numerical appreciation of the numerical behavior of the considered algorithm taking into account the number of iterations as well as the time needed for optimality. The results obtained show the efficiency of these new directions.